<!--
To change this template, choose Tools | Templates
and open the template in the editor.
-->
<!DOCTYPE html>
<html>
    <head>
        <title></title>
        <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
    </head>
    <body>
        <pre>// Regular expressions, NFAs, DFAs, and dot graphs
            // This file contains, in order:
            //   * A class Nfa for representing an NFA (a nondeterministic finite 
            //     automaton), and for converting it to a DFA (a deterministic 
            //     finite automaton).  Most complexity is in this class.
            //   * A class Dfa for representing a DFA, a deterministic finite 
            //     automaton, and for writing a dot input file representing the DFA.
            //   * Classes for representing regular expressions, and for building an 
            //     NFA from a regular expression
            //   * A test class that creates an NFA, a DFA, and a dot input file 
            //     for a number of small regular expressions.  The DFAs are 
            //     not minimized.</pre>
    </body>
</html>
